Multipacket Hot-Potato Routing on Processor Arrays
نویسندگان
چکیده
In this paper, we consider the problems of multipacket batch and balanced routing on d-dimensional (constant d 2) torus and mesh-connected processor arrays. We present new \hot-potato" routing algorithms which achieve the best known average-case and worst-case time bounds for both problems on all such networks. In particular, our results include the following: 1. Algorithms that route almost all batch routing problems where each node is the source of at most bd=2c ? 1 packets in dn=2 + O(log 2 n) time steps on the d-dimensional n d-node torus and in dn + O(log 2 n) time steps on the d-dimensional n d-node mesh. 2. Randomized algorithms that route any routing problem where each node is the source and destination of at most bd=2c ? 1 packets in dn + O(log 2 n) time steps on the d-dimensional n d-node torus and in 2dn+O(log 2 n) time steps on the d-dimensional n d-node mesh, with high probability.
منابع مشابه
Experimental Evaluation of Hot { Potato RoutingAlgorithms on 2 { Dimensional Processor Arrays ?
In this paper we consider the problem of routing packets in two{dimensional torus{connected processor arrays. We describe the implementation of four hot{potato routing algorithms and study their performance by experimentation. The algorithms are either greedy in the sense that packets try to move towards their destination by adaptively using a shortest path, or have the property that the path t...
متن کاملDeterministic k Routing on Meshes With Applications to Worm Hole Routing
In k routing each of the n processing units of an n n mesh connected computer initially holds packet which must be routed such that any processor is the destination of at most k packets This problem re ects practical desire for routing better than the popular routing of permutations k routing also has implications for hot potato worm hole routing which is of great importance for real world syst...
متن کاملOptimal-Algorithms for Multipacket Routing Problems on Rings
We study multipacket routing problems on rings of processors. We prove a new lower bound of 2n=3 routing steps for the case that k, the number of packets per processor, is at most 2. We also give an algorithm that tightens this lower bound. For the case where k > 2, the lower bound is kn=4. The trivial algorithm needs in the worst case kbn=2c steps to terminate. An algorithm that completes the ...
متن کامل